Counting cocircuits and convex two-colourings is #P-complete
نویسندگان
چکیده
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of counting the number of cocircuits of a graph is #P-complete.
منابع مشابه
Approximately Counting H-Colorings is $\#\mathrm{BIS}$-Hard
We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H . If H is an irreflexive bipartite graph or a reflexive complete graph then counting list H-colourings is trivially in polynomial time. Otherwise, if H is an irreflexive bipartite permutation graph or a reflexi...
متن کاملSome #p-completeness Proofs for Colourings and Independent Sets
We consider certain counting problems involving colourings of graphs and independent sets in hypergraphs. Using polynomial interpolation techniques, we show that these problems are #P -complete. Therefore, e cient approximate counting is the most one can realistically expect to achieve. Rapidly mixing Markov chains which can be used for approximately solving these counting problems have been re...
متن کاملCounting Partitions of Graphs
Recently, there has been much interest in studying certain graph partitions that generalize graph colourings and homomorphisms. They are described by a pattern, usually viewed as a symmetric {0, 1, ∗}matrix M . Existing results focus on recognition algorithms and characterization theorems for graphs that admit such M -partitions, or M partitions in which vertices of the input graph G have lists...
متن کاملCounting and Sampling H-Colourings
For counting problems in #P which are “essentially self-reducible”, it is known that sampling and approximate counting are equivalent. However, many problems of interest do not have such a structure and there is already some evidence that this equivalence does not hold for the whole of #P. An intriguing example is the class ofH-colouring problems, which have recently been the subject of much st...
متن کاملApproximately Counting H-Colourings is #BIS-Hard
We consider the problem of counting H-colourings from an input graph G to a target graph H . We show that if H is any fixed graph without trivial components, then the problem is as hard as the well-known problem #BIS, which is the problem of (approximately) counting independent sets in a bipartite graph. #BIS is a complete problem in an important complexity class for approximate counting, and i...
متن کامل